Computing Kemeny's constant for a barbell graph
نویسندگان
چکیده
منابع مشابه
Computing the Grothendieck constant of some graph classes
Given a graph G = ([n], E) and w ∈ R , consider the integer program maxx∈{±1}n ∑ ij∈E wijxixj and its canonical semidefinite programming relaxation max ∑ ij∈E wijv T i vj , where the maximum is taken over all unit vectors vi ∈ R. The integrality gap of this relaxation is known as the Grothendieck constant κ(G) of G. We present a closed-form formula for the Grothendieck constant of K5-minor free...
متن کاملComputing GA4 Index of Some Graph Operations
The geometric-arithmetic index is another topological index was defined as 2 deg ( )deg ( ) ( ) deg ( ) deg ( ) G G uv E G G u v GA G u v , in which degree of vertex u denoted by degG (u). We now define a new version of GA index as 4 ( ) 2 ε ( )ε ( ) ( ) ε ( ) ε ( ) G G e uv E G G G u v GA G u v , where εG(u) is the eccentricity of vertex u. In this paper we compute this new t...
متن کاملcomputing ga4 index of some graph operations
the geometric-arithmetic index is another topological index was defined as2 deg ( )deg ( )( )deg ( ) deg ( )g guv eg gu vga gu v , in which degree of vertex u denoted by degg (u). wenow define a new version of ga index as 4( )2 ε ( )ε ( )( )ε ( ) ε ( )g ge uv e g g gu vga g u v , where εg(u) isthe eccentricity of vertex u. in this paper we compute this new topological index for twogr...
متن کاملThe Software Migration Barbell
Software source migration is the reengineering task of deploying existing software in a new environment, by significant modification of the source code. This paper presents a model, called the “Barbell Model”, which accounts for the author’s experiences in carrying out semi-automated source migration tasks. The Barbell Model consists of three phases: source normalization, carried out in the sou...
متن کاملGraph Transformation in Constant Time
We present conditions under which graph transformation rules can be applied in time independent of the size of the input graph: graphs must contain a unique root label, nodes in the left-hand sides of rules must be reachable from the root, and nodes must have a bounded outdegree. We establish a constant upper bound for the time needed to construct all graphs resulting from an application of a f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Linear Algebra
سال: 2019
ISSN: 1081-3810
DOI: 10.13001/ela.2019.5175